Applying abstract acceleration to (co-)reachability analysis of reactive programs
نویسندگان
چکیده
Acceleration methods are commonly used for computing precisely the effects of loops in the reachability analysis of counter machine models. Applying these methods on synchronous dataflow programs, e.g. Lustre programs, requires to deal with the non-deterministic transformations due to numerical input variables. In this article we address this problem by extending the concept of abstract acceleration of Gonnord et al. to numerical input variables. Moreover, we describe the dual analysis for co-reachability. We compare our method with some alternative techniques based on abstract interpretation pointing out its advantages and limitations. At last, we give some experimental results.
منابع مشابه
Extending Abstract Acceleration Methods to Data - Flow Programs with Numerical Inputs 1
Acceleration methods are commonly used for computing precisely the effects of loops in the reachability analysis of counter machine models. Applying these methods on synchronous data-flow programs with Boolean and numerical variables, e.g. Lustre programs, firstly requires the enumeration of the Boolean states in order to obtain a control graph with numerical variables only. Secondly, accelerat...
متن کاملExtending Abstract Acceleration Methods to Data-Flow Programs with Numerical Inputs
Acceleration methods are commonly used for computing precisely the effects of loops in the reachability analysis of counter machine models. Applying these methods on synchronous data-flow programs with Boolean and numerical variables, e.g. Lustre programs, firstly requires the enumeration of the Boolean states in order to obtain a control graph with numerical variables only. Secondly, accelerat...
متن کاملLogico-Numerical Abstract Acceleration and Application to the Verification of Data-Flow Programs
Acceleration methods are commonly used for speeding up the convergence of loops in reachability analysis of counter machine models. Applying these methods to synchronous data-flow programs with Boolean and numerical variables, e.g., Lustre programs, requires the enumeration of the Boolean states in order to obtain a control flow graph (CFG) with numerical variables only. Our goal is to apply ac...
متن کاملAbstraction and Acceleration in SMT-based Model-Checking for Array Programs
ion and Acceleration in SMT-based Model-Checking for Array Programs Francesco Alberti1, Silvio Ghilardi2, Natasha Sharygina1 1 Faculty of Informatics, University of Lugano, Switzerland 2 Università degli Studi di Milano, Milan, Italy Abstract Abstraction (in its various forms) is a powerful established technique in modelchecking; still, when unbounded data-structures are concerned, it cannot al...
متن کاملDefinability of Accelerated Relations in a Theory of Arrays and Its Applications
ion and Acceleration in SMT-based Model-Checking for Array Programs Francesco Alberti1, Silvio Ghilardi2, Natasha Sharygina1 1 Faculty of Informatics, University of Lugano, Switzerland 2 Università degli Studi di Milano, Milan, Italy Abstract Abstraction (in its various forms) is a powerful established technique in modelchecking; still, when unbounded data-structures are concerned, it cannot al...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Symb. Comput.
دوره 47 شماره
صفحات -
تاریخ انتشار 2012